搜索资源列表
AVL___Tree
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
1500PrePosterous
- 此程序给出一个算法,用于计算当已知一个m叉查找树的先序和后序遍历序列后,存在多少种中序遍历可能。输入格式为m s1 s2,其中m表示m叉树,例子 2 abc cba 结果为4 2 abc bca 结果为1 10 abc bca 结果为45 13 abejkcfghid jkebfghicda 结果为207352860-this procedure is an algorithm, When used in the calculation of a known m Binary S
optimalBinarySeachTree
- Build an optimal binary search tree using dynamic programming.-Build an optimal binary search tree using d ynamic programming.
Kd-tree
- KD 树代码,常见的数据搜索算法,比较实用-KD tree code, common data search algorithms, more practical
tree_min
- 该程序是基于IDL平台下开法的应用随机搜索树进行搜索的优化算法实例!-the program is based on the following IDL platform Act of random search tree search algorithm optimization examples!
manytrees
- 常用树数据结构集合,包括二叉树、二叉查找树、AA树、红黑树、伸展树的一整套实现,自带包装器、异常处理类,方便使用-common pool tree data structure, including the binary tree, binary search tree, AA tree, a red, black tree extend to achieve a set of trees, bringing their wrapper, abnormal class, user-friendl
datastruct
- 安全数组 普通链表 哈希表 二叉搜索树 AVL树 集合类 通用自动机 所有类均使用模板编写,并不特定于 Windows 平台,只要有 C++ 编译程序的操作平台都可使用。-security array ordinary Chain Hash Table 2 forks search tree AVL Tree collections Universal Automatic machine is used in all types of template preparation, is not s
BST - Bina2889710132001
- Binary Search Tree - with additional recursion functions (smallest, parent & successor) etc
genBST
- 通用二叉搜索树,包含的算法有:输出广度优先遍历、前序、中序、后序遍历结果,按树的形状打印树,统计总节点数,统计叶子节点数,统计右节点数,计算树的高度,删除所有叶子节点,插入节点,查找节点,删除节点,由前序遍历结果和中序遍历结果生成树,由后序遍历结果和中序遍历结果生成树,检查该树是否平衡和完全平衡。-generic binary search tree contains the algorithm are : output breadth - first traversal, the former
tree
- 树的应用,实现树的递归,非递归的多种顺序查找 -tree applications, the tree is recursive and non - recursive sequence of the multiple search
tree
- 用 java实现的 搜索二叉树的插入、删除、遍历和平衡,是自己用与数据结构考试编写的 ,对数的相关编程很有用-java with the realization of the binary tree search, insert, delete, and traverse balance, and the use of their own data structure prepared by the examination of a number of useful programming
Shop1_3_Arrays_Linked_List_Binary_Search_Tree
- Shop1_3 _ Arrays_Linked List_Binary Search Tree Sh op1_3 _ Arrays_Linked List_Binary Search Tr
2309
- 北京大学ACM比赛题目 Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until
ass6.........mars
- binary search tree /*class TreeNode { public: TreeNode(char m[80],TreeNode*left, TreeNode *right) void Inorder(void) char data[80] TreeNode *left_ptr TreeNode *right_ptr }
chapter8
- 数据结构与算法分析中binary search tree的JAVA代码 请需要的同学下载
小游戏:五子棋的设计与实现
- 五子棋的设计与实现 本“五子棋“程序只编写了人机对弈部分,运用了博弈树进行搜索,在选取最优的走步时使用极大极小分析法,考虑到搜索的时间复杂度和空间复杂度,在程序中只进行了2步搜索,即计算机在考虑下一步的走法时,只对玩家进行一步的推测。(程序中的棋盘规格为15*15)。-renju the design and implementation of the "331" procedure prepared by the Human-Computer Chess, a game u
最优二叉搜索树
- 算法设计的动态规划中的最优二叉搜索树问题,是用VC++编写的-algorithm design of dynamic optimal planning of two forks search tree problem by using VC + + prepared
程序员之家 - 用VisualC++6_0递归查找目录树 论文
- 用递归查找目录树 这个小程序本人认为还不错 大家共享一下吧 有用的到的 尽量下吧 -using recursive search tree this small program, I think it is good share my views useful to the next as it
binSearch
- 数据结构二叉 搜索树的实现很好的例子!-data structures: a good example of binary search tree implementation
datast
- array.h: 安全数组 linkedlist.h: 普通表 dclinkedlist: 双向循环链表 hashtable.h: 哈希表 binstree.h: 二叉搜索树 avltree.h: AVL 树 如果要存储集合(元素不可重复)并快速查找,最佳的是 binstree.h(二叉搜索树)。 如果要存储二维或更高维的表格,最佳的是 hashtable.h(哈系表)。AVL 树的插入成本非常高(删除函数也没有实现),但 AVL 的搜索效率极高,所以适用于在程序开始前初始化程-NOTE: